Ideological Sublations: Resolution of Dialectic in Population-based Optimization
نویسندگان
چکیده
We propose a population-based optimization algorithm inspired by two main thinking modes in philosophy. Particles are regarded as thinkers and their locations are interpreted as the theses. Both thinking modes are based on the concept of dialectic and thesis-antithesis paradigm. Idealistic and materialistic antitheses are formulated as optimization models. Based on the models, the population is coordinated for dialectical interactions. At the population-based context, the formulated optimization models are reduced to simple detection problems. According to the assigned thinking mode to each thinker, dialectic quantities of each thinker with two other specified thinkers are measured. One of them at maximum dialectic is selected and its position is called the available antithesis for the considered thesis. Thesis-antithesis interactions are defined by meaningful distribution of the step-sizes for each thinking mode. In fact, the thinking modes are regarded as exploration and exploitation elements of the proposed algorithm. The result is a delicate balance between the thinkers without any requirement for adjustment of the step-size coefficients. Main parameter of the proposed algorithm is the number of particles appointed to each thinking modes. An additional integer parameter is defined to boost the stability of the final algorithm in facing with some specific problems. The proposed algorithm is evaluated on different problems. First, a testbed of 12 single objective continuous functions in low and high dimensions is considered. Then, proposed algorithm is tested for sparse reconstruction problem in the context of compressed sensing. The results indicate efficiency and in some cases superiority of performance of the proposed algorithm in comparison with a variety of well-known algorithms. Low runtime is another remarkable advantage of the proposed algorithm.
منابع مشابه
Dialectic Search
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it tightly integrates and yet clearly marks off of one another the two most important aspects of local search algorithms, search space exploration and exploitation. We believe that this makes dialectic search easy to use ...
متن کاملRESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM
This paper studies the nonlinear optimization problems subject to bipolar max-min fuzzy relation equation constraints. The feasible solution set of the problems is non-convex, in a general case. Therefore, conventional nonlinear optimization methods cannot be ideal for resolution of such problems. Hence, a Genetic Algorithm (GA) is proposed to find their optimal solution. This algorithm uses th...
متن کاملرمزگشایی از فضامندی پدیده جهانی شدن با تکیه بر شاکله مفهومی تریالکتیک لوفور
Introduction This survey is based on deciphering the space of globalization phenomenon and revealing affected by spatial actions mechanism under investment discipline (according to compressed space and time). The basic question is how the space could be used, organized and created so that it could be in line with investment flow progress necessities. This can be unrevealed by applying concep...
متن کاملOptimization of an ultra-high-resolution rectangular pixelated parallel-hole collimator with a CZT pixelated semiconductor detector for HiRe-SPECT system
Introduction: In nuclear medicine, the use of a pixelated semiconductor detector such as CZT is an of growing interest for introducing new devices. Especially, the spatial resolution can be improved by using a pixelated parallel-hole collimator with equal holes and pixel sizes based on the pixelated detector. The purpose of this study was to compare the effect of pixelated and ...
متن کاملInvestigation of the Spatial Resolution and Field of View with Change of Magnification in VRX CT
Introduction: Variable resolution x-ray (VRX) CT is a new type of CT that can image objects at various spatial resolutions. In a VRX CT scanner, the spatial resolution increases at the cost of reduction in the field of view (FOV). An important factor that limits the spatial resolution of the VRX CT is the effect of focal spot size. Also, the optimum magnification is different at each incident a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1707.06992 شماره
صفحات -
تاریخ انتشار 2017